Uncertainty measures for rough formulae in rough logic: An axiomatic approach
نویسندگان
چکیده
منابع مشابه
An Axiomatic Approach to the Roughness Measure of Rough Sets
In Pawlak’s rough set theory, a set is approximated by a pair of lower and upper approximations. To measure numerically the roughness of an approximation, Pawlak introduced a quantitative measure of roughness by using the ratio of the cardinalities of the lower and upper approximations. Although the roughness measure is effective, it has the drawback of not being strictly monotonic with respect...
متن کاملUncertainty Measures of Rough Set Prediction
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. In keeping within the rough set philosophy of non–invasive data analysis, we present three model selection criteria, using information theoretic entropy in the spirit of the minimum description length principle. Our ma...
متن کاملInformation-Theoretic Measures of Uncertainty for Rough Sets and Rough Relational Databases
Rough set theory has become well-established as a mechanism for uncertainty management in a wide variety of applications including databases. This paper addresses the measurement of uncertainty in rough sets and rough relational databases by introducing a measurement based on information theory. This rough entropy is discussed as it applies to rough sets in general, and in particular to aspects...
متن کاملRough Sets for Uncertainty Reasoning
Rough sets have traditionally been applied to decision (classification) problems. We suggest that rough sets are even better suited for reasoning. It has already been shown that rough sets can be applied for reasoning about knowledge. In this preliminary paper, we show how rough sets provide a convenient framework for uncertainty reasoning. This discussion not only presents a new topic for futu...
متن کاملVery Rough Notes : Uncertainty
Lotteries. A lottery L = (p, x) (or gamble) is a vector of payoffs (x1, x2, . . . , xn) with probabilities (p1, p2, . . . , pn). The payoffs might be consumption bundles or monetary payoffs. St Petersburg Paradox. The payoff is 2, where n is the first time the coin comes up heads. The expected value is infinite. If the game lasts just two rounds, it is worth 1 + 1. If it lasts 3 rounds, it is w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2012
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.10.074